The Diophantine equations
نویسنده
چکیده
The aim of this paper is to prove the possibility of linearization of such equations by means of introduction of new variables. For n = 2 such a procedure is well known, when new variables are components of spinors and they are widely used in mathematical physics. For example, parametrization of Pythagoras threes a + b , a − b , 2ab may be cited as an example in number theory where two independent variables form a spinor which can be obtained by solution of a system of two linear equations. We also investigate the combinatorial estimate for the smallest sum r(n) = r1 + r2 − 1 for solvable equations of such a type as r(n) 6 2n + 1 (recently the better one with r(n) 6 2n − 1 was received by L. Habsieger (J. of Number Theory 45 (1993) 92)). Apart from that we consider two conjectures about r(n) and particular solutions for n 6 11 which were found with the help of the algorithm that is not connected with linearization.
منابع مشابه
A Generalized Fibonacci Sequence and the Diophantine Equations $x^2pm kxy-y^2pm x=0$
In this paper some properties of a generalization of Fibonacci sequence are investigated. Then we solve the Diophantine equations $x^2pmkxy-y^2pm x=0$, where $k$ is positive integer, and describe the structure of solutions.
متن کاملDiophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملThe key exchange cryptosystem used with higher order Diophantine equations
One-way functions are widely used for encrypting the secret in public key cryptography, although they are regarded as plausibly one-way but have not been proven so. Here we discuss the public key cryptosystem based on the system of higher order Diophantine equations. In this system those Diophantine equations are used as public keys for sender and recipient, and both sender and recipient can ob...
متن کاملDiophantine Equations Involving Arithmetic Functions of Factorials
DIOPHANTINE EQUATIONS INVOLVING ARITHMETIC FUNCTIONS OF FACTORIALS Daniel M. Baczkowski We examine and classify the solutions to certain Diophantine equations involving factorials and some well known arithmetic functions. F. Luca has showed that there are finitely many solutions to the equation:
متن کاملInteger Solutions of Some Diophantine Equations via Fibonacci and Lucas Numbers
We study the problem of finding all integer solutions of the Diophantine equations x2 − 5Fnxy − 5 (−1) y2 = ±Ln, x2 − Lnxy + (−1) y2 = ±5F 2 n , and x2 − Lnxy + (−1) y2 = ±F 2 n . Using these equations, we also explore all integer solutions of some other Diophantine equations.
متن کاملTopic Proposal: Faltings’ Theorem
A “diophantine equation” is a system of polynomial equations where we restrict the solution set to rational or integral values. The study of diophantine equations is the study of the nature of these integral or rational solution sets. “diophantine geometry” is the study of diophantine equations using the language of algebraic geometry. Specifically, one associates to a diophantine equation the ...
متن کامل